Partitions and permutations
نویسندگان
چکیده
منابع مشابه
Partitions and permutations
With any permutation g of a set Ω is associated a partition of Ω into the cycles of g. What information do we get about a group G of permutations if we know either the set or the multiset of partitions of Ω, or of partitions of n = |Ω|, which arise as the cycle partitions of its elements? Some partial answers to these questions are given.
متن کاملPartitions, permutations and posets
1. Partitions For the definition of (number) partition, Ferrers diagram and Young tableaux, conjugate partition see Chapter 6 of R. Stanley’s Algebraic Combinatorics book. This section is based (more or less) on the treatment of the book A Course in Combinatorics by Van Lint and Wilson (Chapter 15). Proposition 1.1. Let pk(n) be the number of partitions of n into at most k parts. Let p(n) be th...
متن کاملStudies in Partitions and Permutations
This work is divided into three related but self-contained parts. In the first part an inversion theorem similar to M6bius inversion is derived for the set of partitions of the integer n partially ordered by the dominance ordering. This theorem is then used to obtain a purely combinatorial derivation of the irreducible characters of the symmetric group Sn, to obtain results about symmetric func...
متن کاملLabeled partitions with colored permutations
In this paper, we extend the notion of labeled partitions with ordinary permutations to colored permutations in the sense that the colors are endowed with a cyclic structure. We use labeled partitions with colored permutations to derive the generating function of the fmajk indices of colored permutations. The second result is a combinatorial treatment of a relation on the q-derangement numbers ...
متن کاملCyclic Permutations of Sequences and Uniform Partitions
Let ~r = (ri) n i=1 be a sequence of real numbers of length n with sum s. Let s0 = 0 and si = r1 + . . . + ri for every i ∈ {1, 2, . . . , n}. Fluctuation theory is the name given to that part of probability theory which deals with the fluctuations of the partial sums si. Define p(~r) to be the number of positive sum si among s1, . . . , sn and m(~r) to be the smallest index i with si = max 06k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2005
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.04.019